Round-robin tournaments generated by the Circle Method have maximum carry-over
نویسندگان
چکیده
منابع مشابه
A heuristic for minimizing weighted carry-over effects in round robin tournaments
The carry-over effects value is one of the various measures one can consider to assess the quality of a round robin tournament schedule. We introduce and discuss a new, weighted variant of the minimum carry-over effects value problem. The problem is formulated by integer programming and an algorithm based on the hybridization of the Iterated Local Search metaheuristic with a multistart strategy...
متن کاملScheduling asynchronous round-robin tournaments
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known “circle design” performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule th...
متن کاملRound robin tournaments and three index assignments
Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...
متن کاملFirst-mover advantage in round-robin tournaments
We study round-robin tournaments with either three or four symmetric players whose values of winning are common knowledge. In the round-robin tournament with three players there are three stages, each of which includes one match between two players. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium and show that each player maximizes his ex...
متن کاملWin Sequences for Round-robin Tournaments
Each of n teams numbered 1, 2, · · · , n play each of the other n− 1 teams exactly one time for a total of ( n 2 ) = n(n − 1)/2 games. Each game produces a win for one team and a loss for the other team. Define (wi, li), i = 1, 2, · · · , n, to be the win-loss records for the teams. That is, team i, i = 1, 2, · · · , n, wins wi games and loses li games where wi + li = n− 1. Of course, n ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2017
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-017-1115-x